Pancyclicity of recursive circulant graphs
نویسندگان
چکیده
In this paper, we study the existence of cycles of all lengths in the recursive circulant graphs, and we show a necessary and sufficient condition for the graph being pancyclic and bipancyclic. 2002 Elsevier Science B.V. All rights reserved.
منابع مشابه
Panconnectivity and edge-pancyclicity of faulty recursive circulant G(2m, 4)
In this paper, we investigate a problem on embedding paths into recursive circulant G(2, 4) with faulty elements (vertices and/or edges) and show that each pair of vertices in recursive circulant G(2, 4), m ≥ 3, are joined by a fault-free path of every length from m + 1 to |V (G(2, 4)\F )| − 1 inclusive for any fault set F with |F | ≤ m− 3. The bound m−3 on the number of acceptable faulty eleme...
متن کاملRecognizing Recursive Circulant Graphs G(cd M ; D)
Recursive circulant graphs G(N; d) have been introduced in 1994 by Park and Chwa PC94] as a new topology for interconnection networks. Recursive circulant graphs G(N; d) are circu-lant graphs with N nodes and with jumps of powers of d. A subfamily of recursive circulant graphs (more precisely, G(2 k ; 4)) is of same order and degree than the hypercube of dimension k, with sometimes better param...
متن کاملRecognizing Recursive
Recursive circulant graphs G(N; d) have been introduced in 1994 by Park and Chwa [PC94] as a new topology for interconnection networks. Recursive circulant graphs G(N; d) are circulant graphs with N nodes and with jumps of powers of d. A subfamily of recursive circulant graphs (more precisely, G(2; 4)) is of same order and degree than the hypercube of dimension k, with sometimes better paramete...
متن کاملAn Improved Construction Method for MIHCs on Cycle Composition Networks
Many well-known interconnection networks, such as kary n-cubes, recursive circulant graphs, generalized recursive circulant graphs, circulant graphs and so on, are shown to belong to the family of cycle composition networks. Recently, various studies about mutually independent hamiltonian cycles, abbreviated as MIHC’s, on interconnection networks are published. In this paper, using an improved ...
متن کاملDisjoint Hamiltonian Cycles in Recursive Circulant Graphs
We show in this paper that the circulant graph G( 2”‘, 4) is Hamiltonian decomposable, and propose a recursive construction method. This is a partial answer to a problem posed by B. Alspach. @ 1997 Published by Elsevier Science B.V.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Inf. Process. Lett.
دوره 81 شماره
صفحات -
تاریخ انتشار 2002